package com.tricode.ile.training.task.one.greatestcommondivisor;

public class GreatestCommonDivisor {
	
	/**
	 * 
	 * @param a is the first element
	 * @param b is the second element
	 * @return the greatest common divisor from those two elements
	 */
	public int functionGCD(int a, int b){
		if (b==0) return a;
		return functionGCD(b,a%b);
	}

}
